Extremal area of polygons sliding along curves

نویسندگان

چکیده

In this paper we study the area function of polygons, where vertices are sliding along curves. We give geometric criteria for critical points and determine also Hesse matrix at those points. This is starting point a Morse-theoretic approach, which includes relation with topology configuration spaces. Moreover condition extremal gives rise to new type billiard: inner billiard.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Characterization of Extremal Antipodal Polygons

Let S be a set of 2n points on a circle such that for each point p ∈ S also its antipodal (mirrored with respect to the circle center) point p′ belongs to S. A polygon P of size n is called antipodal if it consists of precisely one point of each antipodal pair (p, p′) of S. We provide a complete characterization of antipodal polygons which maximize (minimize, respectively) the area among all an...

متن کامل

Extremal problems for convex polygons

Consider a convex polygon Vn with n sides, perimeter Pn, diameter Dn, area An, sum of distances between vertices Sn and widthWn. Minimizing or maximizing any of these quantities while fixing another defines ten pairs of extremal polygon problems (one of which usually has a trivial solution or no solution at all). We survey research on these problems, which uses geometrical reasoning increasingl...

متن کامل

Extremal antipodal polygons and polytopes

5 Let S be a set of 2n points on a circle such that for each point p ∈ S also its antipodal 6 (mirrored with respect to the circle center) point p′ belongs to S. A polygon P of size n is called 7 antipodal if it consists of precisely one point of each antipodal pair (p, p′) of S. 8 We provide a complete characterization of antipodal polygons which maximize (minimize, 9 respectively) the area am...

متن کامل

On Guarding Orthogonal Polygons with Sliding Cameras

A sliding camera inside an orthogonal polygon P is a point guard that travels back and forth along an orthogonal line segment γ in P . The sliding camera g can see a point p in P if the perpendicular from p onto γ is inside P . In this paper, we give the first constant-factor approximation algorithm for the problem of guarding P with the minimum number of sliding cameras. Next, we show that the...

متن کامل

Covering Orthogonal Polygons with Sliding k-Transmitters

In this paper we consider a new variant of covering in an orthogonal art gallery problem where each guard is a sliding k-transmitter. Such a guard can travel back and forth along an orthogonal line segment, say s, inside the polygon. A point p is covered by this guard if there exists a point q ∈ s such that pq is a line segment normal to s and has at most k intersections with the polygon’s boun...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Geometry and Physics

سال: 2023

ISSN: ['1879-1662', '0393-0440']

DOI: https://doi.org/10.1016/j.geomphys.2023.104786